On the solvability of weakly linear systems of fuzzy relation equations?

Systems of fuzzy relation equations and inequalities in which an unknown is on the one side equation or inequality are linear systems. They most studied ones, a vast literature systems focuses finding solutions solvability criteria for such The situation quite different with so-called weakly systems, both sides inequality. Precisely, scholars have only given characterization set exact to This paper describes relations that solve certain degree provides ways compute them. We pay special attention developing algorithms computing preorders equivalences some extent establish additional properties approximate over particular types complete residuated lattices. demonstrate advantage this approach via many examples arise from problem aggregation networks.